Communication Issues regarding Parallel Functional Graph Rewriting
نویسنده
چکیده
Efficient communication is the basis of an implementation of a parallel language on a distributed machine architecture. This article handles about the communication mechanism that is needed to support parallel graph rewriting in Concurrent Clean. The danger of deadlock is imminent at several levels of such a system. Communication problems and their solutions are closely related to memory management issues, garbage collection in particular. In fact the communication mechanism presented here is a global memory management system. It is part of a distributed runtime system that has been moulded to fit parallel graph rewriting as implemented in Concurrent Clean.
منابع مشابه
Efficient Routing using Class Climbing
This paper concentrates on a routing algorithm that is adaptive and avoids deadlocks and starvation. It is a general store-and-forward packet router that has been developed to be used as part of a distributed runtime system for Concurrent Clean, an experimental, lazy, higher-order parallel functional programming language based on term graph rewriting. The routing algorithm is based on the one u...
متن کاملThe Class Transputer Router
This paper presents an adaptive routeing algorithm that avoids deadlocks and starvation. It is a general store-and-forward packet router that has been developed to be used as part of a distributed runtime system for Concurrent Clean, an experimental, lazy, higher-order parallel functional programming language based on term graph rewriting. The routeing algorithm is based on the one used by the ...
متن کاملFunctional Programming and Parallel Graph Rewriting
functional programming and parallel graph rewriting What to say and what to do when mostly your friends love reading? Are you the one that don't have such hobby? So, it's important for you to start having that hobby. You know, reading is not the force. We're sure that reading will lead you to join in better concept of life. Reading will be a positive activity to do every time. And do you know o...
متن کاملTowards an Intermediate Language based on Graph Rewriting
Lean is an experimental language for specifying computations in terms of graph rewriting. It is based on an alternative to Term Rewriting Systems (TRS) in which the terms are replaced by graphs. Such a Graph Rewriting System (GRS) consists of a set of graph rewrite rules which specify how a graph may be rewritten. Besides supporting functional programming, Lean also describes imperative constru...
متن کاملHigh-Performance parallel graph reduction
Parallel graph reduction is an attractive implementation for functional programming languages because of its simplicity and inherently distributed nature. This paper outlines some of the issues raised by parallel compiled graph reduction, and presents the approach we have adopted for our parallel machine, GRIP. We concentrate on two main areas: • Static and dynamic techniques to control the gro...
متن کامل